{	Problem: http://codeforces.ru/problemset/problem/30/A
	Verdict: Accepted
}
var a,b,n,x,i:int64; f:boolean;
function pow(a,b:int64):int64;
var pw:int64;
begin
if b=0 then result:=1 else begin
  pw:=a;
  result:=1;
  while b>0 do begin
    if b mod 2=1 then result:=result*pw;
    pw:=pw*pw;
    b:=b div 2;
  end;
end;
end;
begin
read(a,b,n);
if b=0 then write(0) else
if a=0 then write('No solution') else begin
if b mod a<>0 then write('No solution') else begin
  f:=false;
  i:=-1000;
  while (not f) and (i<=1000) do begin
    if a*pow(i,n)=b then begin
      x:=i;
      f:=true;
    end;
    inc(i);
  end;
  if f then write(x) else write('No solution');
end;
end;
end.